منابع مشابه
Anti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملThe Ramsey number of dense graphs
The Ramsey number r(H) of a graphH is the smallest number n such that, in any two-colouring of the edges of Kn, there is a monochromatic copy of H . We study the Ramsey number of graphs H with t vertices and density ρ, proving that r(H) ≤ 2 √ ρ . We also investigate some related problems, such as the Ramsey number of graphs with t vertices and maximum degree ρt and the Ramsey number of random g...
متن کاملThe anti-Ramsey number of perfect matching
An r-edge coloring of a graph G is a mapping h : E(G) → [r], where h(e) is the color assigned to edge e ∈ E(G). An exact r-edge coloring is an r-edge coloring h such that there exists an e ∈ E(G) with h(e) = i for all i ∈ [r]. Let h be an edge coloring of G. We say G is rainbow if no two edges in G are assigned the same color by h. The anti-Ramsey number, AR(G,n), is the smallest integer r such...
متن کاملAnti-Ramsey number of matchings in hypergraphs
A k-matching in a hypergraph is a set of k edges such that no two of these edges intersect. The anti-Ramsey number of a k-matching in a complete s-uniform hypergraph H on n vertices, denoted by ar(n, s, k), is the smallest integer c such that in any coloring of the edges of H with exactly c colors, there is a k-matching whose edges have distinct colors. The Turán number, denoted by ex(n, s, k),...
متن کاملLocal Anti-Ramsey Numbers of Graphs
In an edge-coloured host graph G, a subgraph H is properly coloured if no two incident edges of H receive the same colour, and rainbow if no two edges of H receive the same colour. Given a positive integer k, a host graph G, an edge-colouring c of G (c is not necessarily proper), then c is a k-colouring if c uses k colours overall, c is a local k-colouring if at most k colours are used at each ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2019
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2078